Optical multiplication and division using modified -signed -digit symbolic substitution
نویسنده
چکیده
CONTENTS 1. Introduction 2. Symbolic substitution (SS) rules for modified-signed-digit (MSD) addition and subtraction 3. Optical implementation of SS rules 4. Parallel MSD multiplication 4.1. MSD multiplication algorithm 4.2. Optical implementation of the MSD multiplication 5. MSD convergence division 6. Conversion between binary and MSD representations 6.1. From binary code to MSD code 6.2. From MSD code to two's complement code 7. Performance analysis 7.1. Optical addition time 7.2. Optical multiplication time 7.3. Optical division time 8. Conclusions 9. Acknowledgments 10. References
منابع مشابه
New Symbolic Substitution Algorithms for Optical Arithmetic using Signed -Digit Representation
In this paper, we present a new approach to designing optical digital arithmetic systems. We present new arithmetic algorithms based on a modified signed -digit number representation. New Signed -digit symbolic substitution rules are introduced to implement them. These signed -digit arithmetic algorithms are well suited for optical implementation because, of the confined carry propagation withi...
متن کاملA New Symbolic Substitution Based Addition Algorithm
Symbolic substitution, a parallel processing technique, has been proposed in computing literature to perform fast, carry-free addition of numbers. Several algorithms and corresponding symbolic substitution tables have been developed for addition of two numbers represented in binary, modified signed digit (MSD), and canonical modified signed digit (CMSD) number systems. In this paper, however, w...
متن کاملA signed binary multiplication technique pdf
Bit is added to the left of the partial product using sign extension.products required to half that required by a simple add and shift method. A signed binary multiplication technique. Quarterly Journal of.Booths multiplication algorithm is a multiplication algorithm that multiplies two signed binary numbers in twos complement notation. The above mentioned technique is inadequate when the multi...
متن کاملAn Efficient Parallel CMM-CSD Modular Exponentiation Algorithm by Using a New Modified Modular Multiplication Algorithm
This paper presents a new modified Montgomery modular multiplication algorithm based on canonical signed-digit (CSD) representation, and sliding window method. In this modified Montgomery modular multiplication algorithm, signed-digit recoding technique is used in order to increase probability of the zero bits. Also sliding window method is used in order to reduce the multiplication steps consi...
متن کاملMultiplication of Signed-digit Numbers
A recently proposed technique for common-multiplicand multiplication of binary numbers is shown to be applicable to signed-digit numbers. We prove that multiplication of a single k-bit multiplicand by n k-bit multipliers can be performed using 0:306nk additions for canonically recoded signed-digit numbers, while the binary case requires 0:375nk additions.
متن کامل